Designing a local path repair algorithm for directed diffusion protocol
نویسندگان
چکیده
منابع مشابه
Designing a local path repair algorithm for directed diffusion protocol
ss as: M atics J (2 Abstract This paper proposes an implementation for the directed diffusion paradigm aids in studying this paradigm’s operations and evaluates its behavior according to this implementation. The directed diffusion is evaluated with respect to the loss percentage, lifetime, end-to-end delay, and throughput. From these evaluations some suggestions and modifications are proposed t...
متن کاملThe Path repair algorithm
In this paper, we introduce a new solving algorithm for Constraint Satisfaction Problems: the path-repair algorithm. The two main points of that algorithm are: it makes use of a repair algorithm (local search) as a basis and it works on a partial instantiation in order to be able to use ltering techniques. Di erent versions are presented and rst experiments with both systematic and non systemat...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملA path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملA Path-Repair Algorithm for Solving Scheduling Problems
Search algorithms for solving CSP (Constraint Satisfaction Problems) usually fall into one of two main families: local search algorithms and systematic algorithms. Both families have their own advantages, Designing hybrid approaches seem promising since those advantages may be combined into a single approach. In this paper, we propose a new hybrid technique which performs an overall local searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Egyptian Informatics Journal
سال: 2012
ISSN: 1110-8665
DOI: 10.1016/j.eij.2012.07.001